Hourglasses and Hamilton cycles in 4-connected claw-free graphs
نویسندگان
چکیده
We show that if G is a 4-connected claw-free graph in which every induced hourglass subgraph S contains two non-adjacent vertices with a common neighbor outside S, then G is hamiltonian. This extends the fact that 4-connected claw-free, hourglass-free graphs are hamiltonian, thus proving a broader special case of a conjecture by Matthews and Sumner.
منابع مشابه
Hamilton cycles in 5-connected line graphs
A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness.
متن کاملExtending Cycles Locally to Hamilton Cycles
A Hamilton circle in an infinite graph is a homeomorphic copy of the unit circle S1 that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of Oberly and Sumner to infinite graphs. Furthermore, we show that such graphs are Hamilton-connected if and only if they are 3-...
متن کاملA Closure for 1-Hamilton-Connectedness in Claw-Free Graphs
A graph G is 1-Hamilton-connected if G − x is Hamilton-connected for every vertex x ∈ V (G). In the paper we introduce a closure concept for 1-Hamiltonconnectedness in claw-free graphs. If G is a (new) closure of a claw-free graph G, then G is 1-Hamilton-connected if and only if G is 1-Hamilton-connected, G is the line graph of a multigraph, and for some x ∈ V (G), G − x is the line graph of a ...
متن کاملOn 1-Hamilton-connected claw-free graphs
A graph G is k-Hamilton-connected (k-hamiltonian) if G−X is Hamilton-connected (hamiltonian) for every setX ⊂ V (G) with |X| = k. In the paper, we prove that (i) every 5-connected claw-free graph with minimum degree at least 6 is 1Hamilton-connected, (ii) every 4-connected claw-free hourglass-free graph is 1-Hamilton-connected. As a byproduct, we also show that every 5-connected line graph with...
متن کامل2-factors with Bounded Number of Components in Claw-free Graphs
In this paper, we show that every 3-connected claw-free graph G has a 2-factor having at most max { 2 5(α+1), 1 } cycles, where α is the independence number of G. As a corollary of this result, we also prove that every 3-connected claw-free graph G has a 2-factor with at most ( 4|G| 5(δ+2)+ 2 5 ) cycles, where δ is the minimum degree of G. This is an extension of a known result on the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 48 شماره
صفحات -
تاریخ انتشار 2005